#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
bool vis[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    stack<LL>s;
    for(LL i=1;i<=n;i++) cin>>a[i],vis[i]=0;
    LL tn=n;
    for(LL i=n;i>=1;i--){
        if(a[i]!=tn){
            s.push(a[i]);
            vis[a[i]]=true;
        }
        else if(a[i]==tn){
            s.push(a[i]);
            while(!s.empty()){
                LL x=s.top();s.pop();
                vis[x]=true;
                cout<<x<<" ";
            }
            while(vis[tn]) tn--;
        }
    }
    cout<<"\n";
  }
return 0;
}
